Nonblock Source Coding with a Fidelity Criterion
نویسندگان
چکیده
منابع مشابه
Strong converses in source coding relative to a fidelity criterion
Abstracf -Two strong converses are obtained for an abstract alphabet stationary ergodic source coded relative to an appropriate fidelity criterion. It is shown that given a distortion rate point ( D , R ) , which lies below the rate distortion curve, 1) block codes that operate at rate level R must encode sample source blocks at a rate exceeding D with probability tending to one as block length...
متن کاملOn tree coding with a fidelity criterion
This paper reexamines Jelinek’s proof that tree codes can be used to approach the rate-distortion bound. It is shown that the branching process used in Jelinek’s proof is not a (strict-sense) branching process (SSBP) when the source is asymmetric. Branching processes with random environments (BPWRE) are introduced and used to extend the proof to general discrete-time memoryless sources. The the...
متن کاملHierarchical Guessing with a Fidelity Criterion
In an earlier paper, we studied the problem of guessing a random vector X within distortion D, and characterized the best attainable exponent E(D; ) of the th moment of the number of required guesses G(X) until the guessing error falls below D. In this paper, we extend these results to a multi-stage, hierarchical guessing model, which allows for a faster search of a codeword vector at the encod...
متن کاملZero-Error Source Coding with Maximum Distortion Criterion
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ×Y → [0,∞) be given. We study the minimum asymptotic rate required to describe a source distributed over X within a (given) distortion threshold D at every sample. The problem is hence a min-max problem, and the distortion measure is extended to vectors as follows: for x ∈ X, y ∈ Y, d(x, y) = maxi d(xi, yi). In ...
متن کاملError Exponent for Coding of Memoryless Gaussian Sources with a Fidelity Criterion
We are interesting in the error exponent for source coding with fidelity criterion. For each fixed distortion level ∆, the maximum attainable error exponent at rate R, as a function of R, is called the reliability function. The minimum rate achieving the given error exponent is called the minimum achievable rate. For memoryless sources with finite alphabet, Marton (1974) gave an expression of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1975
ISSN: 0091-1798
DOI: 10.1214/aop/1176996354